Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets

This study focuses on solving the vehicle routing problem (VRP) of E-logistics service providers. In our problem, each must visit some pick up nodes first, for instance, warehouses to orders then makes deliveries customers in list. Each pickup node has its own list more than one requiring delivery. The objective is minimize total travelling cost while real-world application constraints, such as heterogeneous vehicles, capacity limits, time window, driver working duration, etc. are still considered. research firstly proposes a mathematical model this multiple and delivery with window fleets (MPMDVRPTWHF). next step, ant colony optimization algorithm studied solve large-scale.